Epistemic Virtues, Metavirtues, and Computational Complexity
نویسندگان
چکیده
منابع مشابه
The Epistemic Virtues of Consistency
The lottery paradox has been discussed widely. The standard solution to the lottery paradox is that a ticket holder is justified in believing each ticket will lose but the ticket holder is also justified in believing not all of the tickets will lose. If the standard solution is true, then we get the paradoxical result that it is possible for a person to have a justified set of beliefs that she ...
متن کاملEpistemic Virtues and Epistemic Values: A Skeptical Critique1
Epistemic virtues or epistemic values, we are told, play a major role in our assessments of the bearing of evidence in science. There is something quite right about this notion; and there is something quite wrong about it. My goal in the chapter is to explain each. In brief, what is right about the notion of epistemic virtue or value is that criteria such as simplicity and explanatory power do ...
متن کاملComplexity Results in Epistemic Planning
Epistemic planning is a very expressive framework that extends automated planning by the incorporation of dynamic epistemic logic (DEL). We provide complexity results on the plan existence problem for multi-agent planning tasks, focusing on purely epistemic actions with propositional preconditions. We show that moving from epistemic preconditions to propositional preconditions makes it decidabl...
متن کاملOrdered Epistemic Logic: Semantics, Complexity and Applications
Many examples of epistemic reasoning in the literature exhibit a stratified structure: defaults are formulated on top of an incomplete knowledge base. These defaults derive extra information in case information is missing in the knowledge base. In autoepistemic logic, default logic and ASP this inherent stratification is not preserved as they may refer to their own knowledge or logical conseque...
متن کاملEpistemic coalition logic: completeness and complexity
Coalition logic is currently one of the most popular logics for multi-agent systems. While logics combining coalitional and epistemic operators have received considerable attention, completeness results for epistemic extensions of coalition logic have so far been missing. In this paper we provide several such results and proofs. We prove completeness for epistemic coalition logic with common kn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nous
سال: 2004
ISSN: 0029-4624,1468-0068
DOI: 10.1111/j.0029-4624.2004.00479.x